package algorithm.tree;

public class BinaryNode<E> {
	E element;
	BinaryNode<E> left;
	BinaryNode<E> right;
	
	BinaryNode(E elem){
		this(elem, null, null);
	}
	
	BinaryNode(E elem, BinaryNode<E> left, BinaryNode<E> right){
		element = elem;
		this.left = left;
		this.right = right;
	}

}
